Queueing systems with pre-scheduled random arrivals

نویسندگان

  • Gianluca Guadagni
  • Sokol Ndreca
  • Benedetto Scoppola
چکیده

We consider a point process i + ξi, where i ∈ Z and the ξi’s are i.i.d. random variables with variance σ. This process, with a suitable rescaling of the distribution of ξi’s, converges to the Poisson process in total variation for large σ. We then study a simple queueing system with our process as arrival process, and we provide a complete analytical description of the system. Although the arrival process is very similar to the Poisson process, due to negative autocorrelation the resulting queue is very different from the Poisson case. We found interesting connections of this model with the statistical mechanics of Fermi particles. This model is motivated by air traffic systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Queueing system with pre-scheduled random arrivals

We consider a point process obtained summing to each point i of the set of the integer Z an i.i.d random variable ξi having a variance that can be also much larger than 1. We compare the process obtained with this construction with the standard Poisson process, and we show that in some sense our process tends to converge for large variance of ξ to the Poisson process in total variation. We then...

متن کامل

Stability of Scheduled Multi-access Communication over Quasi-static Flat Fading Channels with Random Coding and Joint Maximum Likelihood Decoding

We consider stability of scheduled multiaccess message communication with random coding and joint maximumlikehood decoding of messages. The framework we consider here models both the random message arrivals and the subsequent reliable communication by suitably combining techniques from queueing theory and information theory. The number of messages that may be scheduled for simultaneous transmis...

متن کامل

Optimal Server Assignment in Multi-Server Queueing Systems with Random Connectivities

In this paper, we investigate the problem of assignment of K identical servers to a set of N parallel queues in a time slotted queueing system. The connectivity of each queue to each server is randomly changing with time; each server can serve at most one queue and each queue can be served by at most one server per time slot. Such multi-server queueing systems were widely applied in modeling th...

متن کامل

Analysis of unreliable bulk queue with statedependent arrivals

In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, and the failed server immediately joins the repair facility which takes constant duration to repair the server. By using suppl...

متن کامل

Queueing Systems with Appointment-Driven Arrivals, Non-Punctual Customers, and No-Shows

We consider queueing systems where a finite number of customers arrive over time to a service system, consisting of either a single or multiple servers. The arrival of customers is driven by appointments, with a scheduled appointment time associated with each customer. However, customers are not necessarily punctual and may arrive either earlier or later than their scheduled appointment times. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Meth. of OR

دوره 73  شماره 

صفحات  -

تاریخ انتشار 2011